A characterization of stochastically stable networks

نویسندگان

  • Olivier Tercieux
  • Vincent Vannetelbosch
چکیده

Jackson and Watts (J Econ Theory 71: 44–74, 2002) have examined the dynamic formation and stochastic evolution of networks. We provide a refinement of pairwise stability, p-pairwise stability, which allows us to characterize the stochastically stable networks without requiring the “tree construction” and the computation of resistance that may be quite complex. When a 1 2 -pairwise stable network exists, it is unique and it coincides with the unique stochastically stable network. To solve the inexistence problem of p-pairwise stable networks, we define its set-valued extension with the notion of p-pairwise stable set. The 2 -pairwise stable set exists and is unique. Any stochastically stable networks is included in the 2 -pairwise stable set. Thus, any network outside the 2 -pairwise stable set must be considered as a non-robust network. We also show that the 2 -pairwise stable set can contain no pairwise stable network and we provide examples where a set of networks is more “stable” than a pairwise stable network.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Selfish peering and routing in the Internet

The Internet is a loose amalgamation of independent service providers acting in their own selfinterest. We examine the implications of this economic reality on peering relationships. Specifically, we consider how the incentives of the providers might determine where they choose to interconnect with each other. We consider a game where two selfish network providers must establish peering points ...

متن کامل

The Evolution of R&D Networks

We study the evolution of R&D networks in a Cournot model where firms may lower marginal costs due to bilateral R&D collaborations. Stochastically stable R&D networks exhibit the dominant group architecture, and, contrary to the existing literature, generically unique predictions about the size of the dominant group can be obtained. This size decreases monotonically with respect to the cost of ...

متن کامل

Potential games in volatile environments

This papers studies the co-evolution of networks and play in the context of finite population potential games. Action revision, link creation and link destruction are combined in a continuous-time Markov process. I derive the unique invariant distribution of this process in closed form, as well as the marginal distribution over action profiles and the conditional distribution over networks. It ...

متن کامل

Generalized risk-dominance and asymmetric dynamics

This paper proposes two (ordinal and cardinal) generalizations of Harsanyi and Selten (1988) risk-dominance to multi-player, multi-action games. There are three reasons why generalized risk-dominance (GR-dominance) is interesting. Extending the logic of riskdominance, GR-dominant actions can be interpreted as best responses to conjectures that satisfy a certain type of symmetry. Second, in a lo...

متن کامل

Stochastically Bounded Burstiness for Communication Networks

A network calculus is developed for processes whose burstiness is stochastically bounded by general decreasing functions. This calculus is useful for a large class of input processes, including important processes exhibiting “subexponentially bounded burstiness” such as fractional Brownian motion. Moreover, it allows judicious capture of the salient features of real-time traffic, such as the “c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Int. J. Game Theory

دوره 34  شماره 

صفحات  -

تاریخ انتشار 2006